Cracking columns

Database Cracking

Database indices provide a non-discriminative navigational infrastructure to localize tuples of interest. Their maintenance cost is taken during database updates. In this work we study the complementary approach, addressing index maintenance as part of query processing using continuous physical reorganization, i.e., cracking the database into manageable pieces. Each query is interpreted not onl...

Database Cracking

This paper talks about the self-oraganized index maintainance approach of database cracking. It provides fundamental knowledge as well as the description of a basic implementation of database cracking. Alongside multiple cracking algorithms, the implementation also contains the code of a cracking index. By combining these two features the implementation allows the execution of range queries on ...

Cracking BING and Beyond

The problem, generic objectness proposal, aims to reduce the candidate windows for object detection tasks. The popular evaluation criterion for related methods is detection-rate/windows-amount(DR-#WIN), where DR is the percentage of groundtruth objects covered by proposal windows. An object is considered “covered” by a window only if the strict PASCAL-overall criterion [3] is satisfied (the int...

Radial cracking with closure

Progressive radial cracking of a clamped plate subjected to crack-face closure is studied. The material behavior is assumed to be elastic-brittle. The cracks are assumed to be relatively long in the sense that the three-dimensional contact problem can be described via a statically equivalent two-dimensional idealization. The number of cracks is supposed large enough to permit a quasi-continuum ...

Evaluating Cracking In Concrete